package com.atguigu.practice;

import java.util.Scanner;

public class TheMostDifficultProblem {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        while(scanner.hasNextLine()){
            String s=scanner.nextLine();
            char[] chars=new char[26];
            chars[0]='V';
            chars[1]='W';
            chars[2]='X';
            chars[3]='Y';
            chars[4]='Z';
            for(int i=5;i<chars.length;i++){
                chars[i]=(char)(i+60);
            }
            StringBuilder sb=new StringBuilder();
            for(int i=0;i<s.length();i++){
                char ch=s.charAt(i);
                if(ch>=65&&ch<=90){
                    sb.append(chars[ch-65]);
                }else{
                    sb.append(ch);
                }
            }
            System.out.println(sb.toString());
        }
    }
}
